Balanced Arrays of Strength Two from Block Designs
نویسندگان
چکیده
Some constructions of balanced arrays of strength two are provided by use of rectangular designs, group divisible designs, and nested balanced incomplete block designs. Some series of such arrays are also presented as well as orthogonal arrays, with illustrations. # 2002 Wiley Periodicals, Inc. J Combin Designs 10: 303–312, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10016
منابع مشابه
Balanced nested designs and balanced arrays
Balanced nested designs are closely related to other combinatorial structures such as balanced arrays and balanced n-ary designs. In particular, the existence of symmetric balanced nested designs is equivalent to the existence of some balanced arrays. In this paper, various constructions for symmetric balanced nested designs are provided. They are used to determine the spectrum of symmetric bal...
متن کاملDouble Arrays, Triple Arrays and Balanced Grids
Triple arrays are a class of designs introduced by Agrawal in 1966 for two-way elimination of heterogeneity in experiments. In this paper we investigate their existence and their connection to other classes of designs, including balanced incomplete block designs and balanced grids.
متن کاملOrthogonal arrays of strength three from regular 3 - wise balanced designsCharles
The construction given in 4] is extended to obtain new innnite families of orthogonal arrays of strength 3. Regular 3-wise balanced designs play a central role in this construction.
متن کاملBalanced arrays of strength two and nested (r,λ)-designs
An (r,λ)-design with mutually balanced nested subdesigns ( for brevity, (r,λ)-design with MBN ) is introduced firstly in this paper. It is shown that an (r,λ)design with MBN is equivalent to a balanced array of strength 2 with s symbols. By the use of a nested design and an orthogonal array, a construction of an (r,λ)design with MBN is given. A direct construction of such an (r,λ)-design, based...
متن کاملCombinatorial Characterizations of Authentication Codes
In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001